Explaining Updates by Minimal Sums

نویسندگان

  • Jürgen Dix
  • Karl Schlechta
چکیده

Human reasoning about developments of the world involves always an assumption of inertia. We discuss two approaches for formalizing such an assumption, based on the concept of an explanation: (1) there is a general preference relation ≺ given on the set of all explanations, (2) there is a notion of a distance between models and explanations are preferred if their sum of distances is minimal. Each distance dist naturally induces a preference relation ≺dist. We show exactly under which conditions the converse is true as well and therefore both approaches are equivalent modulo these conditions. Our main result is a general representation theorem in the spirit of Kraus, Lehmann and Magidor.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tight Lower Bound for the Partial-Sums Problem

This is perhaps one of the most fundamental data structure problems. When the values of A[1, . . . , n] are drawn from a semigroup, its static version (where updates are not allowed) has the famous inverse-Ackermann Θ(α(n)) query bound with linear storage [4]; the dynamic version can be easily solved by a binary tree in O(log n) time per operation, and a corresponding Ω(log n) lower bound was p...

متن کامل

Some Results on Kloosterman Sums and their Minimal Polynomials

This paper introduces two new results on Kloosterman sums and their minimal polynomials. We characterise ternary Kloosterman sums modulo 27. We also prove a congruence concerning the minimal polynomial over Q of a Kloosterman sum. This paper also serves as a survey of our recent results on binary Kloosterman sums modulo 16, 32, 64 and 128 with Petr Lisoněk.

متن کامل

Sums of Strongly z-Ideals and Prime Ideals in ${mathcal{R}} L$

It is well-known that the sum of two $z$-ideals in $C(X)$ is either $C(X)$ or a $z$-ideal. The main aim of this paper is to study the sum of strongly $z$-ideals in ${mathcal{R}} L$, the ring of real-valued continuous functions on a frame $L$. For every ideal $I$ in ${mathcal{R}} L$, we introduce the biggest strongly $z$-ideal included in $I$ and the smallest strongly $z$-ideal containing ...

متن کامل

Feynman Diagrams and Minimal Models for Operadic Algebras

We construct an explicit minimal model for an algebra over the cobar-construction of a differential graded operad. The structure maps of this minimal model are expressed in terms of sums over decorated trees. We introduce the appropriate notion of a homotopy equivalence of operadic algebras and show that our minimal model is homotopy equivalent to the original algebra. All this generalizes and ...

متن کامل

Surprising Symmetries in Distribution of Prime Polynomials

The primes or prime polynomials (over finite fields) are supposed to be distributed ‘irregularly’, despite nice asymptotic or average behavior. We provide some conjectures/guesses/hypotheses with ‘evidence’ of surprising symmetries in prime distribution. At least when the characteristic is 2, we provide conjectural rationality and characterization of vanishing for families of interesting infini...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 266  شماره 

صفحات  -

تاریخ انتشار 1999